Implementing Vertex Connection and Merging

نویسنده

  • Iliyan Georgiev
چکیده

Bidirectional path tracing (BPT) and photon mapping (PM) are probably the two most versatile physically based rendering algorithms available today. It has been acknowledged that BPT and PM are complementary in terms of the types of light transport effects they can efficiently capture. Our recently proposed vertex connection and merging (VCM) algorithm aims to leverage the advantages of both methods by combining vertex connection techniques from BPT and vertex merging techniques from PM via multiple importance sampling [Georgiev et al. 2012]. We showed that this combined algorithm can efficiently capture a wide range of effects, and can be substantially more robust than either BPT or PM alone, while preserving the higher asymptotic performance of BPT. The focus of our original paper is on the formal derivation, asymptotic analysis, and evaluation of the VCM algorithm. In this technical report, we address the most technically challenging part of its ∗e-mail: [email protected] practical implementation – the multiple importance sampling (MIS) weighting. Indeed, correctly implementing MIS is already taxing in BPT, and VCM increases the complexity by adding even more path sampling techniques. More importantly, the efficient light sub-path reuse with vertex merging allows for cheaply constructing large amounts of full paths for each pixel, which in turn significantly increases the impact of path weight evaluation on the overall performance. The traditional BPT-style MIS weight computation that iterates over all path vertices can therefore become inefficient. We derive a new scheme to accumulate and store partial weight sums in the vertices of light and eye sub-paths. This allows us to efficiently compute the weight for a full path only using data cached at the two vertices that are connected or merged. The scheme is similar to the one independently developed by van Antwerpen [2011a; 2011b] for BPT, but in addition accounts for vertex merging techniques. We also discuss how to handle infinite and singular light sources, cameras and materials with MIS, how to use per-pixel merging radii, and how to implement VCM in a memory efficient way.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Gradient-Domain Vertex Connection and Merging

Gradient Domain Vertex Connection and Merging by Weilun Sun Master of Science in Computer Science University of California, Berkeley Professor Yi-Ren Ng, Chair Recently, gradient-domain rendering techniques have shown great promise in reducing Monte Carlo noise and improving overall rendering efficiency. However, all existing gradientdomain methods are built exclusively on top of Monte Carlo in...

متن کامل

Light Transport Simulation with Vertex Connection and Merging (supplemental document)

Benchmarked algorithms. For each scene we show images rendered with (1) path tracing (PT), (2) bidirectional path tracing (BPT), (3) stochastic progressive photon mapping (PPM), (4) a combination of BPT and PPM based on a heuristic caustic path classification (BPT-PPM), two variants of Metropolis light transport: (5) MLTVeach [Veach and Guibas 1997]) and (6) MLT-Kelemen [Kelemen et al. 2002], a...

متن کامل

On the design of architecture-aware algorithms for emerging applications

all the complications related to the data synchronization issues in our algorithm. As our algorithm executes a large fraction of the code inside transactions (τ is large), this may not fit well with STM, but future TM systems with efficient hardware support will resolve this problem. Also, if the input graph is large enough, the level of data contention is low (low pi in our TM model), and our ...

متن کامل

A Hamiltonian approach for explosive percolation

We introduce a cluster growth process that provides a clear connection between equilibrium statistical mechanics and an explosive percolation model similar to the one recently proposed by Achlioptas et al. [Science 323, 1453 (2009)]. We show that the following two ingredients are essential for obtaining an abrupt (first-order) transition in the fraction of the system occupied by the largest clu...

متن کامل

Map-merging in Multi-robot Simultaneous Localization and Mapping Process Using Two Heterogeneous Ground Robots

In this article, a fast and reliable map-merging algorithm is proposed to produce a global two dimensional map of an indoor environment in a multi-robot simultaneous localization and mapping (SLAM) process. In SLAM process, to find its way in this environment, a robot should be able to determine its position relative to a map formed from its observations. To solve this complex problem, simultan...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013